runtime.sudog.next (field)

50 uses

	runtime (current package)
		chan.go#L870: 	sgp.next = nil
		chan.go#L879: 	x.next = sgp
		chan.go#L889: 		y := sgp.next
		chan.go#L896: 			sgp.next = nil // mark as removed (see dequeueSudoG)
		mgc.go#L1829: 		sgnext = sg.next
		mgc.go#L1830: 		sg.next = nil
		proc.go#L477: 			sched.sudogcache = s.next
		proc.go#L478: 			s.next = nil
		proc.go#L506: 	if s.next != nil {
		proc.go#L535: 				last.next = p
		proc.go#L540: 		last.next = sched.sudogcache
		runtime2.go#L337: 	next *sudog
		select.go#L629: 	y := sgp.next
		select.go#L633: 			x.next = y
		select.go#L635: 			sgp.next = nil
		select.go#L640: 		x.next = nil
		select.go#L649: 		sgp.next = nil
		sema.go#L298: 	s.next = nil
		sema.go#L314: 				s.next = t.next
		sema.go#L318: 				if s.next != nil {
		sema.go#L319: 					s.next.parent = s
		sema.go#L333: 				t.next = nil
		sema.go#L354: 			pt = &t.next
		sema.go#L378: 			if s.parent.next != s {
		sema.go#L403: 			ps = &s.next
		sema.go#L422: 		t.next = s.next
		sema.go#L423: 		if t.next != nil {
		sema.go#L424: 			t.next.parent = t
		sema.go#L445: 		for s.next != nil || s.prev != nil {
		sema.go#L446: 			if s.next == nil || s.prev != nil && s.prev.ticket < s.next.ticket {
		sema.go#L457: 				s.parent.next = nil
		sema.go#L466: 	s.next = nil
		sema.go#L477: 	y := x.next
		sema.go#L482: 	x.next = b
		sema.go#L493: 		if p.next != x {
		sema.go#L496: 		p.next = y
		sema.go#L506: 	b := x.next
		sema.go#L508: 	x.next = y
		sema.go#L521: 		if p.next != y {
		sema.go#L524: 		p.next = x
		sema.go#L594: 		l.tail.next = s
		sema.go#L630: 		next := s.next
		sema.go#L631: 		s.next = nil
		sema.go#L676: 	for p, s := (*sudog)(nil), l.head; s != nil; p, s = s, s.next {
		sema.go#L678: 			n := s.next
		sema.go#L680: 				p.next = n
		sema.go#L688: 			s.next = nil